Walks in Path Graph on Four Vertices and Fibonacci Sequence
نویسندگان
چکیده
منابع مشابه
Linkage for the diamond and the path with four vertices
Given graphs G and H , we say G is H-linked if for every injective mapping ` : V (H) → V (G) we can find a subgraphH ′ of G that is a subdivision of H , with `(v) being the vertex of H ′ corresponding to each vertex v of H . In this paper we prove two results on H-linkage for 4-vertex graphs H . Goddard showed that 4-connected planar triangulations are 4-ordered, or in other words C4-linked. We...
متن کاملSelf-Avoiding Walks and Fibonacci Numbers
By combinatorial arguments, we prove that the number of self-avoiding walks on the strip {0, 1} × Z is 8Fn − 4 when n is odd and is 8Fn − n when n is even. Also, when backwards moves are prohibited, we derive simple expressions for the number of length n self-avoiding walks on {0, 1} × Z, Z× Z, the triangular lattice, and the cubic lattice.
متن کاملMining Frequent Graph Sequence Patterns Induced by Vertices
The mining of a complete set of frequent subgraphs from labeled graph data has been studied extensively. Furthermore, much attention has recently been paid to frequent pattern mining from graph sequences (dynamic graphs or evolving graphs). In this paper, we define a novel class of subgraph subsequence called an “induced subgraph subsequence” to enable efficient mining of a complete set of freq...
متن کاملCrossing numbers of join of a graph on six vertices with a path and a cycle
The crossing number of a graph G is the minimum number of crossings of its edges among the drawings of G in the plane and is denoted by cr(G). Zarankiewicz conjectured that the crossing number of the complete bipartite graph Km,n equals . This conjecture has been verified by Kleitman for min {m, n} ≤ 6. Using this result, we give the exact values of crossing number of the join of a certain grap...
متن کاملFibonacci Identities and Graph Colorings
We generalize both the Fibonacci and Lucas numbers to the context of graph colorings, and prove some identities involving these numbers. As a corollary we obtain new proofs of some known identities involving Fibonacci numbers such as Fr+s+t = Fr+1Fs+1Ft+1 + FrFsFt − Fr−1Fs−1Ft−1.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Miskolc Mathematical Notes
سال: 2017
ISSN: 1787-2405,1787-2413
DOI: 10.18514/mmn.2017.1947